Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture

نویسندگان

  • Frédéric Havet
  • Stéphan Thomassé
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Edge-disjoint Hamiltonian Paths and Cycles in Tournaments

We describe sufficient conditions for the existence of Hamiltonian paths in oriented graphs and use these to provide a complete description of the tournaments with no two edge-disjoint Hamiltonian paths. We prove that tournaments with small irregularity have many edge-disjoint Hamiltonian cycles in support of Kelly's conjecture.

متن کامل

Paths, Trees and Cycles in Tournaments

We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.

متن کامل

The maximum number of Hamiltonian paths in tournaments

Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament on n vertices is at most c · n · n! 2n−1 , where c is a positive constant independent of n.

متن کامل

Paths and Cycles in Tournaments

Sufficient conditions are given for the existence of an oriented path with given end vertices in a tournament. As a consequence a conjecture of Rosenfeld is established. This states that if n is large enough, then every non-strongly oriented cycle of order n is contained in every tournament of order n. It is well known and easy to see that every tournament has a directed hamilton path. Rosenfel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 78  شماره 

صفحات  -

تاریخ انتشار 2000